<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">

<html lang="en">

<head>
  <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
  <title>LCOV - cover.info - /home/andres/Programacion/aso_coverage/aso/src/ASO/framework/combinatory_policy_newton.h</title>
  <link rel="stylesheet" type="text/css" href="../../../../../../../../gcov.css">
</head>

<body>

  <table width="100%" border=0 cellspacing=0 cellpadding=0>
    <tr><td class="title">LCOV - code coverage report</td></tr>
    <tr><td class="ruler"><img src="../../../../../../../../glass.png" width=3 height=3 alt=""></td></tr>

    <tr>
      <td width="100%">
        <table cellpadding=1 border=0 width="100%">
        <tr>
          <td width="5%"></td>
          <td width="10%" class="headerItem">Current view:</td>
          <td width="35%" class="headerValue"><a href="../../../../../../../../index.html">directory</a> - <a href="index.html">home/andres/Programacion/aso_coverage/aso/src/ASO/framework</a> - combinatory_policy_newton.h (source / <a href="combinatory_policy_newton.h.func.html">functions</a>)</td>
          <td width="10%"></td>
          <td width="10%" class="headerCovTableHead">Found</td>
          <td width="10%" class="headerCovTableHead">Hit</td>
          <td width="15%" class="headerCovTableHead">Coverage</td>
          <td width="5%"></td>
        </tr>
        <tr>
          <td></td>
          <td class="headerItem">Test:</td>
          <td class="headerValue">cover.info</td>
          <td class="headerItem">Lines:</td>
          <td class="headerCovTableEntry">36</td>
          <td class="headerCovTableEntry">35</td>
          <td class="headerCovTableEntryHi">97.2 %</td>
        </tr>
        <tr>
          <td></td>
          <td class="headerItem">Date:</td>
          <td class="headerValue">2010-08-03</td>
          <td class="headerItem">Functions:</td>
          <td class="headerCovTableEntry">6</td>
          <td class="headerCovTableEntry">6</td>
          <td class="headerCovTableEntryHi">100.0 %</td>
        </tr>
                <tr><td><img src="../../../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
        </table>
      </td>
    </tr>
    <tr><td class="ruler"><img src="../../../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
  </table>

  <table cellpadding=0 cellspacing=0 border=0>
    <tr>
      <td><br></td>
    </tr>
    <tr>
      <td><pre class="source">
<a name="1"><span class="lineNum">       1 </span>                : /**</a>
<span class="lineNum">       2 </span>                :  * \file  combinatory.h
<span class="lineNum">       3 </span>                :  * \brief Definition of CombinatoryNewton template.
<span class="lineNum">       4 </span>                :  *
<span class="lineNum">       5 </span>                :  * ASO: Antiviral Sequence Optimizer
<span class="lineNum">       6 </span>                :  * &lt;http://aso.googlecode.com/&gt;
<span class="lineNum">       7 </span>                :  * Copyright (C) 2010 Velez Ezequiel, Peralta Andres, FuDePAN
<span class="lineNum">       8 </span>                :  *
<span class="lineNum">       9 </span>                :  * This file is part of the ASO project.
<span class="lineNum">      10 </span>                :  *
<span class="lineNum">      11 </span>                :  * Contents:       Header file for ASO providing template CombinatoryNewton.
<span class="lineNum">      12 </span>                :  *
<span class="lineNum">      13 </span>                :  * System:         ASO
<span class="lineNum">      14 </span>                :  * Language:       C++
<span class="lineNum">      15 </span>                :  *
<span class="lineNum">      16 </span>                :  * Author:         Velez Ezequiel, Peralta Andres
<span class="lineNum">      17 </span>                :  * E-Mail:
<span class="lineNum">      18 </span>                :  *
<span class="lineNum">      19 </span>                :  * ASO is free software: you can redistribute it and/or modify
<span class="lineNum">      20 </span>                :  * it under the terms of the GNU General Public License as published by
<span class="lineNum">      21 </span>                :  * the Free Software Foundation, either version 3 of the License, or
<span class="lineNum">      22 </span>                :  * (at your option) any later version.
<span class="lineNum">      23 </span>                :  *
<span class="lineNum">      24 </span>                :  * ASO is distributed in the hope that it will be useful,
<span class="lineNum">      25 </span>                :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
<span class="lineNum">      26 </span>                :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
<span class="lineNum">      27 </span>                :  * GNU General Public License for more details.
<span class="lineNum">      28 </span>                :  *
<span class="lineNum">      29 </span>                :  * You should have received a copy of the GNU General Public License
<span class="lineNum">      30 </span>                :  * along with ASO.  If not, see &lt;http://www.gnu.org/licenses/&gt;.
<span class="lineNum">      31 </span>                :  *
<span class="lineNum">      32 </span>                :  */
<span class="lineNum">      33 </span>                : 
<span class="lineNum">      34 </span>                : #ifndef COMBINATORY_H
<span class="lineNum">      35 </span>                : #define COMBINATORY_H
<span class="lineNum">      36 </span>                : 
<span class="lineNum">      37 </span>                : #include &lt;iterator&gt;
<span class="lineNum">      38 </span>                : #include &lt;mili/mili.h&gt;
<span class="lineNum">      39 </span>                : #include &quot;observer.h&quot;
<span class="lineNum">      40 </span>                : 
<span class="lineNum">      41 </span>                : //! T es el repositorio al cual se le calcula la combinatoria
<a name="42"><span class="lineNum">      42 </span>                : template &lt;class T&gt;</a>
<span class="lineNum">      43 </span>                : class CombinatoryNewton: public CombinatoryPolicy
<span class="lineNum">      44 </span><span class="lineCov">              1 : {</span>
<span class="lineNum">      45 </span>                : public:
<span class="lineNum">      46 </span>                :     typedef typename T::value_type TValue;
<span class="lineNum">      47 </span>                :     typedef std::vector&lt;TValue&gt; Combination;
<span class="lineNum">      48 </span>                : 
<span class="lineNum">      49 </span>                : protected:
<span class="lineNum">      50 </span>                :     typedef typename T::const_iterator TCIterator;
<span class="lineNum">      51 </span>                : 
<span class="lineNum">      52 </span>                :     const size_t MIN;
<span class="lineNum">      53 </span>                :     const size_t MAX;
<span class="lineNum">      54 </span>                :     Observer&lt;T, bool&gt;* observed_by;     //! contiene el observador
<span class="lineNum">      55 </span>                : 
<span class="lineNum">      56 </span>                :     inline bool combinations_builder(Combination&amp; combination, size_t pos, TCIterator start, TCIterator end);
<span class="lineNum">      57 </span>                :     inline bool choose(const T&amp; container, size_t n);
<span class="lineNum">      58 </span>                :     inline bool notify(const Combination&amp; comb);
<span class="lineNum">      59 </span>                : 
<a name="60"><span class="lineNum">      60 </span>                : public:</a>
<span class="lineNum">      61 </span>                :     //! Constructor
<span class="lineNum">      62 </span><span class="lineCov">              1 :     CombinatoryNewton(size_t min, size_t max, const std::string&amp; name): CombinatoryPolicy(name), MIN(min), MAX(max), observed_by()</span>
<span class="lineNum">      63 </span><span class="lineCov">              1 :     {}</span>
<span class="lineNum">      64 </span>                : 
<span class="lineNum">      65 </span>                :     inline bool combine(const T&amp; elements, Observer&lt;T, bool&gt;* observer, CombinationStatus&amp; status);
<span class="lineNum">      66 </span>                : };
<span class="lineNum">      67 </span>                : //----------------------------------------------------------------------------------
<a name="68"><span class="lineNum">      68 </span>                : </a>
<span class="lineNum">      69 </span>                : template&lt;class T&gt;
<span class="lineNum">      70 </span><span class="lineCov">            455 : inline bool CombinatoryNewton&lt;T&gt;::notify(const Combination&amp; comb)</span>
<span class="lineNum">      71 </span>                : {
<span class="lineNum">      72 </span><span class="lineCov">            455 :     T aux;</span>
<span class="lineNum">      73 </span><span class="lineCov">            455 :     CAutonomousIterator&lt;Combination&gt; combit(comb);</span>
<span class="lineNum">      74 </span><span class="lineCov">           2275 :     while (!combit.end())</span>
<span class="lineNum">      75 </span>                :     {
<span class="lineNum">      76 </span><span class="lineCov">           1365 :         insert_into(aux, *combit);</span>
<span class="lineNum">      77 </span><span class="lineCov">           1365 :         ++combit;</span>
<span class="lineNum">      78 </span>                :     }
<span class="lineNum">      79 </span>                : 
<span class="lineNum">      80 </span><span class="lineCov">            455 :     return observed_by-&gt;update(&amp;aux);</span>
<span class="lineNum">      81 </span>                : }
<a name="82"><span class="lineNum">      82 </span>                : </a>
<span class="lineNum">      83 </span>                : template&lt;class T&gt;
<span class="lineNum">      84 </span><span class="lineCov">            576 : inline bool CombinatoryNewton&lt;T&gt;::combinations_builder(Combination&amp; combination, size_t pos, TCIterator start, TCIterator end)</span>
<span class="lineNum">      85 </span>                : {
<span class="lineNum">      86 </span><span class="lineCov">            576 :     TCIterator it = start;</span>
<span class="lineNum">      87 </span><span class="lineCov">            576 :     bool continueComb(true);</span>
<span class="lineNum">      88 </span><span class="lineCov">            576 :     if (pos == 0)</span>
<span class="lineNum">      89 </span><span class="lineCov">            455 :         continueComb = notify(combination);</span>
<span class="lineNum">      90 </span>                :     else
<span class="lineNum">      91 </span>                :     {
<span class="lineNum">      92 </span><span class="lineCov">            817 :         while (it != end &amp;&amp; continueComb)</span>
<span class="lineNum">      93 </span>                :         {
<span class="lineNum">      94 </span><span class="lineCov">            575 :             combination[pos-1] = *it;</span>
<span class="lineNum">      95 </span><span class="lineCov">            575 :             continueComb = combinations_builder(combination, pos - 1, ++it, end);</span>
<span class="lineNum">      96 </span>                :         }
<span class="lineNum">      97 </span>                :     }
<span class="lineNum">      98 </span><span class="lineCov">            576 :     return  continueComb;</span>
<span class="lineNum">      99 </span>                : }
<a name="100"><span class="lineNum">     100 </span>                : </a>
<span class="lineNum">     101 </span>                : template&lt;class T&gt;
<span class="lineNum">     102 </span><span class="lineCov">              1 : inline bool CombinatoryNewton&lt;T&gt;::choose(const T&amp; container, size_t n)</span>
<span class="lineNum">     103 </span>                : {
<span class="lineNum">     104 </span><span class="lineCov">              1 :     Combination combination(n);</span>
<span class="lineNum">     105 </span><span class="lineCov">              1 :     return combinations_builder(combination, n, container.begin(), container.end());</span>
<span class="lineNum">     106 </span>                : }
<span class="lineNum">     107 </span>                : 
<a name="108"><span class="lineNum">     108 </span>                : /*! realiza el calculo combinatorio a lo largo de un rango */</a>
<span class="lineNum">     109 </span>                : template&lt;class T&gt;
<span class="lineNum">     110 </span><span class="lineCov">              1 : inline bool CombinatoryNewton&lt;T&gt;::combine(const T&amp; elements, Observer&lt;T, bool&gt;* observer, CombinationStatus&amp; status)</span>
<span class="lineNum">     111 </span>                : {
<span class="lineNum">     112 </span><span class="lineCov">              1 :     const size_t size = elements.size();</span>
<span class="lineNum">     113 </span><span class="lineCov">              1 :     status.status = Success;</span>
<span class="lineNum">     114 </span><span class="lineCov">              1 :     status.name = get_name();</span>
<span class="lineNum">     115 </span>                : 
<span class="lineNum">     116 </span><span class="lineCov">              1 :     bool continueComb(true);</span>
<span class="lineNum">     117 </span><span class="lineCov">              1 :     observed_by = observer;</span>
<span class="lineNum">     118 </span>                : 
<span class="lineNum">     119 </span><span class="lineCov">              1 :     if (size &lt; MIN)</span>
<span class="lineNum">     120 </span><span class="lineNoCov">              0 :         status.status = Error;</span>
<span class="lineNum">     121 </span>                :     else
<span class="lineNum">     122 </span>                :     {
<span class="lineNum">     123 </span><span class="lineCov">              1 :         size_t k = MIN;</span>
<span class="lineNum">     124 </span><span class="lineCov">              1 :         const size_t k_max = std::min(size, MAX);</span>
<span class="lineNum">     125 </span><span class="lineCov">              3 :         while (k &lt;= k_max &amp;&amp; continueComb)</span>
<span class="lineNum">     126 </span>                :         {
<span class="lineNum">     127 </span><span class="lineCov">              1 :             continueComb = choose(elements , k);</span>
<span class="lineNum">     128 </span><span class="lineCov">              1 :             ++k;</span>
<span class="lineNum">     129 </span>                :         }
<span class="lineNum">     130 </span>                :     }
<span class="lineNum">     131 </span><span class="lineCov">              1 :     return continueComb;</span>
<span class="lineNum">     132 </span>                : }
<span class="lineNum">     133 </span>                : 
<span class="lineNum">     134 </span>                : #endif
</pre>
      </td>
    </tr>
  </table>
  <br>

  <table width="100%" border=0 cellspacing=0 cellpadding=0>
  <tr><td class="ruler"><img src="../../../../../../../../glass.png" width=3 height=3 alt=""></td></tr>
  <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.7</a></td></tr>
  </table>
  <br>

</body>
</html>
